A combined approach for suspicious networks detection in graphs
نویسندگان
چکیده
The recent growth of the social networks of the Internet was followed by the emergence of new forms of threats and vulnerabilities. Users of these social networks sites are not immune to these new challenges. Several studies are devoted to users’ vulnerability in these social networks and their entities. The threat via web 2.0 (soon web 3.0) takes the form of communities of dealers, dormant networks of extremists, organizations and individuals with malicious intent (pedophilia, piracy, hacking, etc.). Social networks have become a large platform for the activities of these groups such as propaganda, recruitment, training, selecting and hitting their targets without crossing any countries borders. All countries are concerned by this potential threat through Web 2.0 and thus the detection of malicious networks on the Internet is a central concern of all state authorities. It is therefore a major objective to detect these malicious networks. In this article we propose to combine anomaly detection with the detection of Familiar Stranger to identify networks that may be vectors of threats (malicious, hidden, dormant networks, etc). In our approach we combine a concept based on the topology and the configuration of the network with a purely sociological concept. Indeed the anomaly detection is devoted to identify individuals whose behaviors (in relation to their interactions with others) are abnormal. Therefore the awareness of these anomalies is crucial because an abnormal behavior is often synonymous with abnormal activity. This is the starting point of our work. Once these anomalies are detected, we propose to explore the network to find the familiar strangers of each of them. At this stage we have a family of nodes, named suspicious nodes, consisting of abnormalities and their respective Familiar Strangers. This family will help us to rebuild a part of the original network including individuals located on the shortest paths connecting suspicious nodes. Our work is a first attempt to build an efficient algorithm to detect suspicious nodes and links in a social network.
منابع مشابه
BeeID: intrusion detection in AODV-based MANETs using artificial Bee colony and negative selection algorithms
Mobile ad hoc networks (MANETs) are multi-hop wireless networks of mobile nodes constructed dynamically without the use of any fixed network infrastructure. Due to inherent characteristics of these networks, malicious nodes can easily disrupt the routing process. A traditional approach to detect such malicious network activities is to build a profile of the normal network traffic, and then iden...
متن کاملتشخیص اجتماعات ترکیبی در شبکههای اجتماعی
One of the great challenges in Social Network Analysis (SNA) is community detection. Community is a group of vertices which have high intra connections and sparse inter connections. Community detection or Clustering reveals community structure of social networks and hidden relationships among their constituents. By considering the increase of datasets related to social networks, we need scalabl...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملOutlier Detection in Wireless Sensor Networks Using Distributed Principal Component Analysis
Detecting anomalies is an important challenge for intrusion detection and fault diagnosis in wireless sensor networks (WSNs). To address the problem of outlier detection in wireless sensor networks, in this paper we present a PCA-based centralized approach and a DPCA-based distributed energy-efficient approach for detecting outliers in sensed data in a WSN. The outliers in sensed data can be ca...
متن کاملADAPTIVE ORDERED WEIGHTED AVERAGING FOR ANOMALY DETECTION IN CLUSTER-BASED MOBILE AD HOC NETWORKS
In this paper, an anomaly detection method in cluster-based mobile ad hoc networks with ad hoc on demand distance vector (AODV) routing protocol is proposed. In the method, the required features for describing the normal behavior of AODV are defined via step by step analysis of AODV and independent of any attack. In order to learn the normal behavior of AODV, a fuzzy averaging method is used fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010